from sys import stdin
T = int(input())
for t in range(T):
n = int(stdin.readline().strip())
a = list(map(int, stdin.readline().strip().split()))
a.sort()
sofar = 0
for i in range(n):
l_next, r_next = 0, 0
if i > 0:
l_next = a[i] - a[i-1]
if i < n-1:
r_next = a[i+1] - a[i]
left = a[i] - a[0]
right = a[n-1] - a[i]
sofar = max(sofar, max(l_next, r_next) + max (left, right))
print(sofar)
#include<bits/stdc++.h>
using namespace std;
void solve()
{
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
int ans = 0;
for (int i = 0; i < n-2; i++)
ans = max(ans, a[n - 1] - a[i] + a[i+1] - a[i]);
for (int i = n - 1; i > 0; i--)
ans = max(ans, a[i] - a[i - 1] + a[i] - a[0]);
//
cout << ans << endl;
}
int main()
{
int t;
cin >> t;
while (t--)
solve();
return 0;
}260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |